Convolutional codes III. Sequential decoding
نویسندگان
چکیده
منابع مشابه
Sequential Decoding of Convolutional Codes
This article surveys many variants of sequential decoding in literature. Rather than introducing them chronologically, this article first presents the Algorithm A, a general sequential search algorithm. The stack algorithm and the Fano algorithm are then described in details. Next, trellis variants of sequential decoding, including the recently proposed maximum-likelihood sequential decoding al...
متن کاملSequential Decoding of Convolutional Codes for Rayleigh Fading Channels
The performance of sequential decoding of long constraint length convolutional codes is evaluated for Rayleigh fading channels. Sequential decoding is not practical below a certain theoretical signal-to-noise ratio, and these theoretical limits are calculated for a number of modulation methods and code rates. As an example, with BPSK modulation, soft decisions and code rate 1/2, the theoretical...
متن کاملHeuristic decoding of convolutional codes
The Viterbi decoding algorithm for convolutional codes presented in 1967 ([1]) offers a good basis for the conception of a hard-wired decoder designed as a system consisting of a great number of very simple processing units (capable of adding and comparing) with a common memory of sufficient size. The software implementa tion of this algorithm using a universal monoprocessor system seems to be...
متن کاملAdaptive decoding of convolutional codes
Convolutional codes, which are frequently used as error correction codes in digital transmission systems, are generally decoded using the Viterbi Decoder. On the one hand the Viterbi Decoder is an optimum maximum likelihood decoder, i.e. the most probable transmitted code sequence is obtained. On the other hand the mathematical complexity of the algorithm only depends on the used code, not on t...
متن کاملViterbi Decoding of Convolutional Codes
At the receiver, we have a sequence of voltage samples corresponding to the parity bits that the transmitter has sent. For simplicity, and without loss of generality, we will assume 1 sample per bit. In the previous lecture, we assumed that these voltages have been digitized to form a received bit sequence. If we decode this received bit sequence, the decoding process is termed hard decision de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1974
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(74)90876-6